A New SVM Multiclass Incremental Learning Algorithm
نویسندگان
چکیده
منابع مشابه
Universum Learning for Multiclass SVM
We introduce Universum learning [1], [2] for multiclass problems and propose a novel formulation for multiclass universum SVM (MU-SVM). We also propose a span bound for MU-SVM that can be used for model selection thereby avoiding resampling. Empirical results demonstrate the effectiveness of MU-SVM and the proposed bound.
متن کاملFast Incremental SVM Learning Algorithm based on Center Convex Vector
A fast SVM learning algorithm is proposed according to incremental learning and center convex hull operator. It is established on analyzing the relevance of support vector and convex hull from the angle of calculation geometry. The convex hull of current training samples is solved in the first place. Further, Euclidean distance elimination is applied to convex hull. Meanwhile, every time when t...
متن کاملSSiCP: a new SVM based Recursive Feature Elimination Algorithm for Multiclass Cancer Classification
An extremely crucial step in the diagnosis of cancers is to select a small number of informative genes for accurate classification. This issue has become a hot focus in the data mining of gene expression profiles. Especially for data with a large number of cancer types, many conventional classification methods show very poor performance. Here, we proposed a new approach for gene selection and m...
متن کاملTop-k Multiclass SVM
Class ambiguity is typical in image classification problems with a large number of classes. When classes are difficult to discriminate, it makes sense to allow k guesses and evaluate classifiers based on the top-k error instead of the standard zero-one loss. We propose top-k multiclass SVM as a direct method to optimize for top-k performance. Our generalization of the well-known multiclass SVM ...
متن کاملSVM Incremental Learning, Adaptation and Optimization
The objective of machine learning is to identify a model that yields good generalization performance. This involves repeatedly selecting a hypothesis class, searching the hypothesis class by minimizing a given objective function over the model’s parameter space, and evaluating the generalization performance of the resulting model. This search can be computationally intensive as training data co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/745815